A Static Implementation of the Basic Andorra Model for Distributed Memory Systems
نویسندگان
چکیده
The paper shows an implementation model to support the execution of the Basic Andorra Model on distributed memory systems. A model for exploiting dependent AND parallelism in Prolog programs on distributed systems is also proposed, as well as the way in which it has to be combined with an OR parallel model. A mechanism for dealing with unbound variables in a distributed environment is proposed. In the current implementation, the arrangement of workers in the system in order to mix both models is done in a static way at the beginning of
منابع مشابه
Parallel Logic Programming Ondistributed Shared Memory
This paper presents an implementation of a parallel logic programming system on a distributed shared memory(DSM) system. Firstly, we give a brief introduction of Andorra-I parallel logic programming system implemented on multi-processors. Secondly, we outline the concurrent programming environment provided by a distributed shared memory system{TreadMarks. Thirdly, we discuss the implementation ...
متن کاملParallel Logic Programming on Distributed Shared Memory System
This paper presents an implementation of a parallel logic programming system on a distributed shared memory(DSM) system. Firstly, we give a brie,f introduction of Andorra-I parallel logic programming system implemented on multiprocessors. Secondly, we ou'tline the concurrent programming environment provided by a distributed shared memory system-TreadMarks. Thirdly, we discuss the implementation...
متن کاملEvaluating Parallel Logic Programming
Parallel logic programming systems are sophisticated examples of symbolic computing systems. They address problems such as dynamic memory allocation, scheduling irregular execution patterns, and managing diierent types of implicit parallelism. Most parallel logic programming systems have been developed for bus-based shared-memory architectures. The complexity of parallel logic programming syste...
متن کاملParallel Logic Programming Systems on Scalable Architectures
Parallel logic programming (PLP) systems are sophisticated examples of symbolic computing systems. They address problems such as dynamic memory allocation, scheduling irregular execution patterns, and managing diierent types of implicit parallelism. Most PLP systems have been developed for bus-based shared-memory architectures. The complexity of PLP systems and the large amount of data they pro...
متن کاملStatic Task Allocation in Distributed Systems Using Parallel Genetic Algorithm
Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...
متن کامل